Linearly Constrained Nonsmooth and Nonconvex Minimization
نویسندگان
چکیده
منابع مشابه
Linearly Constrained Nonsmooth and Nonconvex Minimization
Motivated by variational models in continuum mechanics, we introduce a novel algorithm for performing nonsmooth and nonconvex minimizations with linear constraints. We show how this algorithm is actually a natural generalization of well-known non-stationary augmented Lagrangian methods for convex optimization. The relevant features of this approach are its applicability to a large variety of no...
متن کاملSmoothing methods for nonsmooth, nonconvex minimization
We consider a class of smoothing methods for minimization problems where the feasible set is convex but the objective function is not convex, not differentiable and perhaps not even locally Lipschitz at the solutions. Such optimization problems arise from wide applications including image restoration, signal reconstruction, variable selection, optimal control, stochastic equilibrium and spheric...
متن کاملAn Incremental Path-Following Splitting Method for Linearly Constrained Nonconvex Nonsmooth Programs
The linearly constrained nonconvex nonsmooth program has drawn much attention over the last few years due to its ubiquitous power of modeling in the area of machine learning. A variety of important problems, including deep learning, matrix factorization, and phase retrieval, can be reformulated as the problem of optimizing a highly nonconvex and nonsmooth objective function with some linear con...
متن کاملA BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
We propose an algorithm for solving nonsmooth, nonconvex, constrained optimization problems as well as a new set of visualization tools for comparing the performance of optimization algorithms. Our algorithm is a sequential quadratic optimization method that employs BFGS quasi-Newton Hessian approximations and an exact penalty function whose parameter is controlled using a steering strategy. We...
متن کاملProximal alternating linearized minimization for nonconvex and nonsmooth problems
We introduce a proximal alternating linearized minimization (PALM) algorithm for solving a broad class of nonconvex and nonsmooth minimization problems. Building on the powerful KurdykaLojasiewicz property, we derive a self-contained convergence analysis framework and establish that each bounded sequence generated by PALM globally converges to a critical point. Our approach allows to analyze va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2013
ISSN: 1052-6234,1095-7189
DOI: 10.1137/120869079